On Optimal Orow-Pram Algorithms for Computing Recursively Defined Functions
نویسندگان
چکیده
Received (received date) Revised (revised date) Communicated by (Editor Name) ABSTRACT We investigate parallel algorithms to compute recursively deened functions. Our computational model are parallel random access machines (PRAM's). We preferably make use of the OROW-PRAM (owner read, owner write), a model supposed to be even weaker and more realistic than the EREW-PRAM (exclusive read, exclusive write) and that still provides the opportunities of a completely connected processor network. For OROW-PRAM's we show that our parallel algorithms are work-optimal.
منابع مشابه
Parallel Processing Letters on Optimal Orow-pram Algorithms for Computing Recursively Defined Functions
Received (received date) Revised (revised date) Communicated by (Editor Name) ABSTRACT We investigate parallel algorithms to compute recursively deened functions. Our computational model are parallel random access machines (PRAM's). We preferably make use of the OROW-PRAM (owner read, owner write), a model supposed to be even weaker and more realistic than the EREW-PRAM (exclusive read, exclusi...
متن کاملEfficient Low-Contention Parallel Algorithms
The queue-read queue-write asyn-chronous PRAM model. Parallel algorithms for shared-memory machines. The design and analysis of a new hybrid sorting algorithm. A new universal class of hash functions and dynamic hashing in real time. NYU Ultracomputer { designing an MIMD shared memory parallel computer. In this paper we have presented highly parallel work-optimal algorithms for several fundamen...
متن کاملSimple Linear Work Suffix Array Construction
A suffix array represents the suffixes of a string in sorted order. Being a simpler and more compact alternative to suffix trees, it is an important tool for full text indexing and other string processing tasks. We introduce the skew algorithm for suffix array construction over integer alphabets that can be implemented to run in linear time using integer sorting as its only nontrivial subroutin...
متن کاملEfficient Matrix Chain Ordering in Polylog Time
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give several new parallel algorithms including O(lg3 n)-time and n/lgn-processor algorithms for solving the matrix chain ordering problem and for solving an optimal triangulation problem of convex polygons on the common CR...
متن کاملHierarchically Optimal Average Reward Reinforcement Learning
Two notions of optimality have been explored in previous work on hierarchical reinforcement learning (HRL): hierarchical optimality, or the optimal policy in the space defined by a task hierarchy, and a weaker local model called recursive optimality. In this paper, we introduce two new average-reward HRL algorithms for finding hierarchically optimal policies. We compare them to our previously r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Parallel Processing Letters
دوره 5 شماره
صفحات -
تاریخ انتشار 1995